Does Multi-Clause Learning Help in Real-World Applications?
نویسندگان
چکیده
The ILP system Progol is incomplete in not being able to derive a multi-clause hypothesis from an example. However, due to the assumption that a multi-clause hypothesis can be built by sequentially adding single clauses, Progol’s incompleteness does not stop it being applied to real-world applications. This paper uses two real-world applications in systems biology to study whether a complete multi-clause learning method MC-TopLog can make a difference to learning results compared to the single-clause learning method Progol5. The experimental results show that in both applications there exist data sets, in which hypotheses derived by MC-TopLog have higher predictive accuracies, as well as better biological significance than those of Progol5.
منابع مشابه
Extended clause learning
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoretical results showing clause learning as equivalent in power to resolution. There exist, however, problems that are intractable for resolution, for which clause-learning solvers are hence doomed. In this paper, we presen...
متن کاملAn Unsupervised Learning Method for an Attacker Agent in Robot Soccer Competitions Based on the Kohonen Neural Network
RoboCup competition as a great test-bed, has turned to a worldwide popular domains in recent years. The main object of such competitions is to deal with complex behavior of systems whichconsist of multiple autonomous agents. The rich experience of human soccer player can be used as a valuable reference for a robot soccer player. However, because of the differences between real and simulated soc...
متن کاملMC-TopLog: Complete Multi-clause Learning Guided by a Top Theory
Within ILP much effort has been put into designing methods that are complete for hypothesis finding. However, it is not clear whether completeness is important in real-world applications. This paper uses a simplified version of grammar learning to show how a complete method can improve on the learning results of an incomplete method. Seeing the necessity of having a complete method for real-wor...
متن کاملClause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application areas like verification, diagnosis, planning, and design. Without clause learning, however, DPLL loses most of its effectiveness on real world problems. Recently there has been some work on obtaining a deeper understa...
متن کاملA General Similarity Framework for Horn Clause Logic
First-Order Logic formulæ are a powerful representation formalism characterized by the use of relations, that cause serious computational problems due to the phenomenon of indeterminacy (various portions of one description are possibly mapped in different ways onto another description). Being able to identify the correct corresponding parts of two descriptions would help to tackle the problem: ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011